On the longest path in a recursively partitionable graph
نویسندگان
چکیده
منابع مشابه
On the longest path in a recursively partitionable graph
A connected graph G with order n ≥ 1 is said to be recursively arbitrarily partitionable (R-AP for short) if either it is isomorphic to K1, or for every sequence (n1, ..., np) of positive integers summing up to n there exists a partition (V1, ..., Vp) of V (G) such that each Vi induces a connected R-AP subgraph of G on ni vertices. Since previous investigations, it is believed that a R-AP graph...
متن کاملThe Longest Minimum-Weight Path in a Complete Graph
We consider the minimum-weight path between any pair of nodes of the n-vertex complete graph in which the weights of the edges are i.i.d. exponentially distributed random variables. We show that the longest of these minimum-weight paths has about α logn edges where α ≈ 3.5911 is the unique solution of the equation α logα − α = 1. This answers a question left open by Janson [8].
متن کاملLongest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کاملStructural properties of recursively partitionable graphs with connectivity 2 ∗ Olivier
A connected graph G is said to be arbitrarily partitionable (AP for short) if for every partition (n1, ..., np) of |V (G)| there exists a partition (V1, ..., Vp) of V (G) such that each Vi induces a connected subgraph of G on ni vertices. Some stronger versions of this property were introduced, namely the ones of being online arbitrarily partitionable and recursively arbitrarily partitionable (...
متن کاملA note on the complexity of longest path problems related to graph coloring
In this note, we show that some problems related to the length of the longest simple path from a given vertex in a graph are NP-complete. We also discuss an extension to the graph coloring problem. @ 2004 Elsevier Ltd. All rights reserved. Keywords-Longest path, Graph coloring, Complexity.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Opuscula Mathematica
سال: 2013
ISSN: 1232-9274
DOI: 10.7494/opmath.2013.33.4.631